منابع مشابه
Dynamic Transition Refinement
Refinement of Petri nets is well suited for the hierarchical design of system models. It is used to represent a model at different levels of abstraction. Usually, refinement is a static concept. For many scenarios, however, it is desirable to have a more flexible form of refinement. For example in the context of service updates, e.g. version control in distributed systems, a mechanism for dynam...
متن کاملEquilibrium Refinement in Dynamic
We propose two related equilibrium refinements for voting and agenda-setting games, Sequentially Weakly Undominated Equilibrium (SWUE) and Markov Trembling Hand Perfect Equilibrium (MTHPE), and show how these equilibrium concepts eliminate non-intuitive equilibria that arise naturally in dynamic voting games and games in which random or deterministic sequences of agenda-setters make offers to s...
متن کاملDynamic Ontology Refinement
One of the main reasons why plan execution meets with failure is because the environment in which the plan is being executed does not conform to an agent’s expectations of how it will behave. If an agent is forming and attempting to execute plans in a given domain, these plans will be based on the agent’s understanding of the domain, described in its ontology. Errors in this ontology are likely...
متن کاملRefinement of protein dynamic structure: normal mode refinement.
An x-ray crystallographic refinement method, referred to as the normal mode refinement, is proposed. The Debye-Waller factor is expanded in terms of the effective normal modes whose amplitudes and eigenvectors are experimentally determined by the crystallographic refinement. In contrast to the conventional method, the atomic motions are treated generally as anisotropic and concerted. This metho...
متن کاملRefinement for Transition Systems with Responses
Motivated by the response pattern for property specifications and applications within flexible workflow management systems, we report upon an initial study of modal and mixed transition systems in which the must transitions are interpreted as must eventually, and in which implementations can contain may behaviors that are resolved at run-time. We propose Transition Systems with Responses (TSRs)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2007.03.007